翻訳と辞書 Words near each other ・ Adept (comics) ・ Adept (disambiguation) ・ Adept 320T ・ Adept Manager ・ Adept Press ・ Adept Technology ・ Adeptia ・ Adeptol ・ Adeptus Health ・ AdeptXBBS ・ ADEQ ・ Adequacy.org ・ Adequality ・ Adequate 7 (EP) ・ Adequate and independent state ground ・ Adequate equivalence relation ・ Adequate pointclass ・ Adequate Public Facilities Ordinance ・ Adequate remedy ・ Adequate Seven ・ Adequate stimulus ・ Adequate Yearly Progress ・ Ader ・ Ader (disambiguation) ・ Ader (surname) ・ Ader Avion II ・ Ader Avion III ・ Ader Éole ・ Aderald ・ Aderaldo Ferreira André Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Adequate equivalence relation ： ウィキペディア英語版 Adequate equivalence relation In algebraic geometry, a branch of mathematics, an adequate equivalence relation is an equivalence relation on algebraic cycles of smooth projective varieties used to obtain a well-working theory of such cycles, and in particular, well-defined intersection products. Pierre Samuel formalized the concept of an adequate equivalence relation in 1958. Since then it has become central to theory of motives. For every adequate equivalence relation, one may define the category of pure motives with respect to that relation. Possible (and useful) adequate equivalence relations include ''rational'', ''algebraic'', ''homological'' and ''numerical equivalence''. They are called "adequate" because dividing out by the equivalence relation is functorial, i.e. push-forward (with change of co-dimension) and pull-back of cycles is well-defined. Codimension one cycles modulo rational equivalence form the classical group of divisors. All cycles modulo rational equivalence form the Chow ring. == Definition == Let ''Z *(X)'' := Z() be the free abelian group on the algebraic cycles of ''X''. Then an adequate equivalence relation is a family of equivalence relations, ''∼X'' on ''Z *(X)'', one for each smooth projective variety ''X'', satisfying the following three conditions: # (Linearity) The equivalence relation is compatible with addition of cycles. # (Moving lemma) If $\backslash alpha,\; \backslash beta\; \backslash in\; Z^(X)$ are cycles on ''X'', then there exists a cycle $\backslash alpha\text{'}\; \backslash in\; Z^(X)$ such that $\backslash alpha$ ''~X'' $\backslash alpha\text{'}$ and $\backslash alpha\text{'}$ intersects $\backslash beta$ properly. # (Push-forwards) Let $\backslash alpha\; \backslash in\; Z^(X)$ and $\backslash beta\; \backslash in\; Z^(X\; \backslash times\; Y)$ be cycles such that $\backslash beta$ intersects $\backslash alpha\; \backslash times\; Y$ properly. If $\backslash alpha$ ''~X 0'', then $(\backslash pi\_Y)\_(\backslash beta\; \backslash cdot\; (\backslash alpha\; \backslash times\; Y))$ ''~Y 0'', where $\backslash pi\_Y\; :\; X\; \backslash times\; Y\; \backslash to\; Y$ is the projection. The push-forward cycle in the last axiom is often denoted :$\backslash beta(\backslash alpha)\; :=\; (\backslash pi\_Y)\_(\backslash beta\; \backslash cdot\; (\backslash alpha\; \backslash times\; Y))$ If $\backslash beta$ is the graph of a function, then this reduces to the push-forward of the function. The generalizations of functions from ''X'' to ''Y'' to cycles on ''X × Y'' are known as correspondences. The last axiom allows us to push forward cycles by a correspondence. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Adequate equivalence relation」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.